Single Step Undirected Reconfigurable Networks
نویسندگان
چکیده
منابع مشابه
Single Step Undirected Reconfigurable Networks
Constant time algorithms for the transitive closure and some related graph problems on processor arrays with reconngurable bus systems. In this work we have shown a general construction so that a T steps rn-mesh of size n n can be simulated by a single step rn-mesh, where the corresponding mesh size increase by a factor of n O(T). The construction itself is simpler and smaller as compared to a ...
متن کاملSingle step undirected reconfigurable networks
The recon gurable mesh (rn-mesh) can solve a large class of problems in constant time, including problems that require logarithmic time by other, even shared memory, models such as the pram with a similar number of processors [3]. In this work we show that for the rn-mesh these constants can always be reduced to one, still using a polynomial number of processors. Given a recon gurable mesh that...
متن کاملMapping Semantic Networks to Undirected Networks
There exists an injective, information-preserving function that maps a semantic network (i.e a directed labeled network) to a directed network (i.e. a directed unlabeled network). The edge label in the semantic network is represented as a topological feature of the directed network. Also, there exists an injective function that maps a directed network to an undirected network (i.e. an undirecte...
متن کاملNetwork Coding in Undirected Networks
Recent work in network coding shows that, it is necessary to consider both the routing and coding strategies to achieve optimal throughput of information transmission in data networks. So far, most research on network coding has focused on the model of directed networks, where each communication link has a fixed direction. In this paper, we study the benefits of network coding in undirected net...
متن کاملInfluence Maximization in Undirected Networks
We consider the problem of finding a set of k vertices of maximal total influence in a given undirected network, under the independent cascade (IC) model of influence spread. It is known that influence is submodular in the IC model, and hence a greedy algorithm achieves a (1 − 1/e) approximation to this problem; moreover, it is known to be NP-hard to achieve a better approximation factor in dir...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: VLSI Design
سال: 1999
ISSN: 1065-514X,1563-5171
DOI: 10.1155/1999/71739